//Given an integer array nums and an integer k, return true if there are two dis
//tinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <
//= k. 
//
// 
// Example 1: 
//
// 
//Input: nums = [1,2,3,1], k = 3
//Output: true
// 
//
// Example 2: 
//
// 
//Input: nums = [1,0,1,1], k = 1
//Output: true
// 
//
// Example 3: 
//
// 
//Input: nums = [1,2,3,1,2,3], k = 2
//Output: false
// 
//
// 
// Constraints: 
//
// 
// 1 <= nums.length <= 105 
// -109 <= nums[i] <= 109 
// 0 <= k <= 105 
// 
// Related Topics 数组 哈希表 滑动窗口 
// 👍 316 👎 0


package leetcode.editor.cn;

import java.util.HashMap;
import java.util.Map;

//Java：Contains Duplicate II
class P219ContainsDuplicateIi {
    public static void main(String[] args) {
        Solution solution = new P219ContainsDuplicateIi().new Solution();
        solution.containsNearbyDuplicate(new int[]{1, 2, 3, 1, 2, 3}, 2);
        // TO TEST
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public boolean containsNearbyDuplicate(int[] nums, int k) {
            Map<Integer, Integer> map = new HashMap<>();
            for (int i = 0; i < nums.length; i++) {
                int num = nums[i];
                if (map.containsKey(num)) {
                    int gap = i - map.get(num);
                    if (gap <= k) {
                        return true;
                    }
                }
                map.put(num, i);
            }
            return false;

        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}